#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <climits>
#define int long long 
#define x first 
#define y second 
using namespace std ;
typedef pair<int,int> PII;
const int N = 1e5 + 10;
int a[N];
PII p[N];

void solve()
{
     for(int i = 1; i <= 3; i++)  cin >> a[i];
    // sort(a + 1, a + 3 + 1);
     int p = 2 * a[1];
     if(p + a[2] > a[3] && p + a[3] > a[2] && a[2] + a[3] > p) 
     {
         cout << "Yes" << endl;
         return;
     }    
       int p1 = 2 * a[2];
     if(p1 + a[1] > a[3] && p1 + a[3] > a[1] && a[1] + a[3] > p1) 
     {
         cout << "Yes" << endl;
         return;
     }  
         int p2 = 2 * a[3];
     if(p2 + a[1] > a[2] && p2 + a[2] > a[1] && a[1] + a[2] > p2) 
     {
         cout << "Yes" << endl;
         return;
     }  
    cout << "No" << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int t  = 1;
    //cin >> t;
    while(t -- ) solve();
    return 0;
}